An Entropy Theorem for Computing the Capacity of Weakly -Constrained Sequences
نویسندگان
چکیده
In this correspondence we find an analytic expression for the maximum of the normalized entropy ln where the set is the disjoint union of sets of positive integers that are assigned probabilities , = 1. This result is applied to the computation of the capacity of weakly ( )-constrained sequences that are allowed to violate the ( )-constraint with small probability.
منابع مشابه
An entropy theorem for computing thecapacity of weakly ( d ; k ) - constrained sequencesAugustus
In this correspondence we nd an analytic expression for the maximum of the normalized entropy ? P i2T p i ln p i = P i2T ip i where the set T is the disjoint union of sets S n of positive integers that are assigned probabilities P n , P n P n = 1. This result is applied to the computation of the capacity of weakly (d; k)-constrained sequences that are allowed to violate the (d; k)-constraint wi...
متن کاملAn entropy theorem for computing the capacity of weakly (d, k)-constrained sequences
In this correspondence we nd an analytic expression for the maximum of the normalized entropy ; P i2T p i ln p i = P i2T ip i where t h e set T is the disjoint union of sets S n of positive integers that are assigned p r obabil-ities P n , P n P n = 1. This result is applied to the computation of the capacity of weakly (dd k)-constrained sequences that are allowed to violate the (dd k)-constrai...
متن کاملA common fixed point theorem for weakly compatible maps satisfying common property (E:A:) and implicit relation in intuitionistic fuzzy metric spaces
In this paper, employing the common property ($E.A$), we prove a common fixed theorem for weakly compatible mappings via an implicit relation in Intuitionistic fuzzy metric space. Our results generalize the results of S. Kumar [S. Kumar, {it Common fixed point theorems in Intuitionistic fuzzy metric spaces using property (E.A)}, J. Indian Math. Soc., 76 (1-4) (2009), 94--103] and C. Alaca et al...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملEntropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000